An Approach for Re-ordering and Scheduling of Feature-based NC Program

Nowadays, significant deficiencies exist in the information flow and access along the NC (Numerical Control) process chain. These deficiencies are overcome insufficiently by introducing CAD/CAM systems and feature-oriented specification languages. In contrast to that, the application of new production and new machining systems require an intensive information exchange. The introduced approach enables the preparation for feature-based work plans using methods known from the graph theory. Therefore, the work plan will be mapped into a directed graph in a mathematically defined way. Now it is possible to use algorithms to find the shortest path and a Hamiltonian path inside this directed graph according to given requirements. Thus, the work plan will be re-ordered and scheduled. At the end, the corresponding NC paths will be generated and distributed to the machinery. Thence in this paper, the mathematics, the requirements and the work flow in such a system will is described. A preliminary prototype is introduced as well. As conclusion the transfer of this approach into other production technologies will be discussed.